Multi-armed bandit based distributed resilient consensus and its applications in social networks

Title: Multi-armed bandit based distributed resilient consensus and its applications in social networks
Creator: Hou, Jian; Chen, Zhiyong; Zhang, Mingyue; Wang, Xiaomin
Relation: Journal of the Franklin Institute Vol. 359, Issue 10, p. 4997-5013
Publisher Link: http://dx.doi.org/10.1016/j.jfranklin.2022.04.039
Publisher: Elsevier
Resource Type: journal article
Date: 2022
Description: This paper addresses the resilient consensus problem in the presence of faulty nodes whose state updating is randomly unreliable. Unlike the existing approaches using elimination of extreme neighbor nodes with state updating or trustworthiness evaluation of neighbor nodes by historical information, this paper presents a novel multi-armed bandit based algorithm. The idea is to increase the selection probability of the so-called healthy running subsets against that of the unhealthy running subsets, according to the evaluation of the reward and credibility functions. As a result, the normal nodes in a network can achieve consensus with the influence from the faulty nodes mitigated. The algorithm can also be applied in a social network with antagonistic weights.
Subject: neighbor nodes; runniung subsets; network; algorithm
Identifier: http://hdl.handle.net/1959.13/1487050
Identifier: uon:52033
Identifier: ISSN:0016-0032
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format